Biased Bit Commitment and Applications
نویسندگان
چکیده
We bring forward the primitive of biased bit commitment, define the security of the model, and present a concrete biased bit commitment scheme based on the braid conjugator search problem. The presented scheme is proved to be information-theoretically hiding and computationally binding in the defined model. Finally, to argue the usefulness of this work, we also sketch out some new applications based on this new primitive.
منابع مشابه
Composable security in relativistic quantum cryptography
Relativistic protocols have been proposed to overcome some impossibility results in classical and quantum cryptography. In such a setting, one takes the location of honest players into account, and uses the fact that information cannot travel faster than the speed of light to limit the abilities of dishonest agents. For example, various relativistic bit commitment protocols have been proposed [...
متن کاملA Non-repudiable Biased Bitstring Commitment Scheme on a Post Quantum Cryptosystem
Commitment schemes are fundamental bricks for guaranteeing fairness in upper level cryptographic protocols. Most commitment schemes in the literature rely on hash functions, which should be strongly collision free for the scheme to be secure. We present a commitment scheme, which avoids hash functions by using a public-key cryptosystem based on braid conjugator search problem instead.
متن کاملA brief review on the impossibility of quantum bit commitment
The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was ...
متن کاملMaking An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment)
The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the rst time thirteen years ago. Bit commitment is suucient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic aw in the protocol was discov...
متن کاملA Brief Review on Quantum Bit Commitment
In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements and applications. Next, we present a practical quantum bit commitment scheme, whose security relies on current technological limitations, such as the lack of long-term stable quantum memories. We demonstrate t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 24 شماره
صفحات -
تاریخ انتشار 2008